Resolving the Three-Box Paradox

نویسنده

  • R. E. Kastner
چکیده

An apparent paradox proposed by Aharonov and Vaidman in which a single particle can be found with certainty in two (or more) boxes is analyzed. It is found that the paradox arises from a counterfactual usage of the Aharonov-Bergmann-Lebowitz (ABL) rule. The paradox is resolved by observing that the counterfactual usage of the rule is, in general, not valid. 1. Background. The Aharonov-Bergmann-Lebowitz (ABL) rule is a well-known formula for calculating the probabilities of the possible outcomes of observables measured at an intermediate time t between preand post-selection measurements at times t1 and t2, respectively [Aharonov, Bergmann, and Lebowitz, 1964]. If an intermediate measurement of nondegenerate observable C with eigenvalues {ci} is performed at time t, the ABL rule states that the probability of outcome cj in the case of a preselection for the state |ψ1〉 and a post-selection for the state |ψ2〉 is given by: PABL(cj|ψ1, ψ2) = |〈ψ2|cj〉||〈cj||ψ1〉| ∑ i |〈ψ2|ci〉|2|〈ci||ψ1〉|2 (1) It has recently been shown that the ABL rule cannot be used in a counterfactual sense: i.e., in general, it cannot be used to calculate the probabilities of possible outcomes of observables that have not actually been measured at time t. 2. The three-box example. In his ‘Weak-Measurement Elements of Reality’ (1996), Vaidman discusses an example of what he terms an “ideal-measurement element of reality of the preand post-selected [email protected] In this case, the Hamiltonian H = 0; the ABL rule also applies to the more general case of nonzero Hamiltonian, with a time-dependence of the preand post-selection states in the usual way. Kastner 1998a, 1998b; see also Sharp and Shanks (1993), Cohen (1995), Miller (1996).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ua nt - p h / 06 06 21 8 v 1 2 6 Ju n 20 06 What is paradoxical about the “ Three - box paradox ” ?

What is paradoxical about the " Three-box paradox " ? Abstract This paper is a comment on quant-ph/0606067 by Ravon and Vaid-man, in which they defend the position that the " three-box paradox " is indeed paradoxical.

متن کامل

Classical Three - Box “ paradox ”

A simple classical probabilistic system (a simple card game) classically exemplifies Aharonov and Vaidman’s “Three-Box ‘paradox’ ” [J. Phys. A 24, 2315 (1991)], implying that the Three-Box example is neither quantal nor a paradox and leaving one less difficulty to busy the interpreters of quantum mechanics. An ambiguity in the usual expression of the retrodiction formula is shown to have misled...

متن کامل

Performance-Based Resource Allocation in Higher Education: A Black Box Containing the Paradox of Increasing Efficiency and Decreasing Productivity

To cope with escalating financial resource limitations from both expanding demands for higher education and experiencing a relatively reduction in public support, higher education units have profoundly adopted a performance-based resource allocation mechanism in recent years. Nevertheless, empirical evaluation findings show that the presumed improvement in performance has not been fulfilled. Us...

متن کامل

Fair-balance paradox, star-tree paradox, and Bayesian phylogenetics.

The star-tree paradox refers to the conjecture that the posterior probabilities for the three unrooted trees for four species (or the three rooted trees for three species if the molecular clock is assumed) do not approach 1/3 when the data are generated using the star tree and when the amount of data approaches infinity. It reflects the more general phenomenon of high and presumably spurious po...

متن کامل

Resolving and Exploiting the $k$-CFA Paradox

semantics: k-CFA ((f e), β̂, σ̂, â) ; (e′, β̂′, σ̂′, â′), where Ê(f, β̂, σ̂) ∋ 〈(λ (x) e′), β̂′′〉 â′ = ⌊l · â⌋k Ê(e, β̂, σ̂) = d̂ β̂′ = β̂′′[x 7→ â′] σ̂′ = σ̂ ⊔ [â′ 7→ d̂] And: Ê(x, β̂, σ̂) = σ̂(β̂(x)) Ê((λ (x) e), β̂, σ̂) = {〈(λ (x) e), β̂〉} Resolving and Exploiting the k-CFA Paradox, New England Programming Language and Systems Sysmposium, MIT, December, 2009 – p.5/22 The Paradox of k-CFA Resolving and Exploiting ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998